Extraconnectivity of graphs with large girth
نویسندگان
چکیده
Following Harary, the conditional connectivity (edge-connectivity) of a graph with respect to a given graph-theoretic property is the minimum cardinality of a set of vertices (edges), if any, whose deletion disconnects the graph and every remaining component has such a property. We study the case in which all these components are different from a tree whose order is not greater than n. For instance, the recently studied superconnectivity of a maximally connected graph corresponds to this conditional connectivity for n = 1. For other values of n, some sufficient conditions for a graph to have the maximum possible conditional connectivity are given.
منابع مشابه
Extraconnectivity of graphs with large minimum degree and girth
The extraconnectivity ~,-(n) of a simple connected graph G is a kind of conditional connectivity which is the minimum cardinality of a set of vertices, if any, whose deletion disconnects G in such a way that every remaining component has more than n vertices. The usual connectivity and superconnectivity of G correspond to K(0) and 1<(1), respectively. This paper gives sufficient conditions, rel...
متن کاملOn the extraconnectivity of graphs
Given a simple connected graph G, let K(n) [2(n)] be the minimum cardinality of a set of vertices [edges], if any, whose deletion disconnects G and every remaining component has more than n vertices. For instance, the usual connectivity and the superconnectivity of G correspond to x(0) and ~c(1 ), respectively. This paper gives sufficient conditions, relating the diameter of G with its girth, t...
متن کاملDiameter-girth sufficient conditions for optimal extraconnectivity in graphs
For a connected graph G, the r-th extraconnectivity κr(G) is defined as the minimum cardinality of a cutset X such that all remaining components after the deletion of the vertices of X have at least r+1 vertices. The standard connectivity and superconnectivity correspond to κ0(G) and κ1(G), respectively. The minimum r-tree degree of G, denoted by ξr(G), is the minimum cardinality of N(T ) taken...
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملA new result on chromaticity of K4-homoemorphs with girth 9
For a graph $G$, let $P(G,lambda)$ denote the chromatic polynomial of $G$. Two graphs $G$ and $H$ are chromatically equivalent if they share the same chromatic polynomial. A graph $G$ is chromatically unique if any graph chromatically equivalent to $G$ is isomorphic to $G$. A $K_4$-homeomorph is a subdivision of the complete graph $K_4$. In this paper, we determine a family of chromatically uni...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 127 شماره
صفحات -
تاریخ انتشار 1994